Optimisation for job scheduling at automated container terminals using genetic algorithm

نویسندگان

  • Bradley Skinner
  • Shuai Yuan
  • Shoudong Huang
  • Dikai Liu
  • Binghuang Cai
  • Gamini Dissanayake
  • Haye Lau
  • Andrew Bott
  • Daniel Pagac
چکیده

This paper presents a genetic algorithm (GA)-based optimisation approach to improve container handling operations at the Patrick AutoStrad container terminal located in Brisbane Australia. In this paper we focus on scheduling for container transfers and encode the problem using a two-part chromosome approach which is then solved using a modified genetic algorithm. In simulation experiments, the performance of the GA-based approach and a sequential job scheduling method are evaluated and compared with different scheduling scenarios. The experimental results show that the GA-based approach can find better solutions which improve the overall performance. The GA-based approach has been implemented in the terminal scheduling system and the live testing results show that the GA-based approach can reduce the overall time-related cost of container transfers at the automated container terminal. Crown Copyright 2012 Published by Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

Yard crane scheduling in port container terminals using genetic algorithm

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...

متن کامل

Scheduling Single-Load and Multi-Load AGVs in Container Terminals

In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...

متن کامل

Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Industrial Engineering

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2013